On a subclass of context-free groups
نویسندگان
چکیده
منابع مشابه
Semi-Groups Acting on Context-Free Graphs
Let ? be some context-free graph. We give suucient conditions on a semi-group of bisimulations H ensuring that the quotient Hn? is context-free. Using these suucient conditions we show that the quotient Aut(?)n? of ? by its full group of automorphisms is always context-free. We then give examples showing optimality (in some sense) of the above result.
متن کاملOn a Kind of Fatou Property of Context-Free Groups
In [4] Berstel and Sakarovitch pointed out that from a proof given in [2] one can deduce that a rational set of a group G which is included in a subgroup H of G is already rational in H (an explicit proof is given in [12]). They called this “a kind of Fatou property of groups” according to similar properties of certain formal power series [14]. Another kind of Fatou property was shown by Eilenb...
متن کاملAn Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars
There is a close relationship between formal language theory and data compression. Since 1990’s various types of grammar-based text compression algorithms have been introduced. Given an input string, a grammar-based text compression algorithm constructs a context-free grammar that only generates the string. An interesting and challenging problem is pattern matching on context-free grammars P of...
متن کاملon the comparison of keyword and semantic-context methods of learning new vocabulary meaning
the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...
15 صفحه اولGroups with Context-free Co-word Problem
The class of co-context-free groups is studied. A co-context-free group is defined as one whose coword problem (the complement of its word problem) is context-free. This class is larger than the subclass of context-free groups, being closed under the taking of finite direct products, restricted standard wreath products with context-free top groups, and passing to finitely generated subgroups an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1991
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1991250302551